Current Issue : July-September Volume : 2025 Issue Number : 3 Articles : 5 Articles
The mesoscopic phase separation in two- and three-dimensional gels has been studied by computer simulation of a bead-spring model of Lennard-Jones particles. The formation of complex networks of high-density phase (HDP) has been investigated and partially explained by competing short- and long-range energies. HDP network formation was found to occur at certain combinations of temperature and spring coefficients, given sufficient particle density. The morphology of the HDP networks changed with these three parameters. HDP networks became more faceted with higher spring coefficients, wider but less dense at higher temperatures, and more voluminous and compact at larger densities. HDP network formation was preceded by a stage of HDP precipitation and followed by a stage of surface minimization....
Quantum secret sharing (QSS) is a typical multipartite cryptographic primitive, which is an important part of quantum communication network. Existing QSS protocols generally require basis selection and matching, which would increase the quantum resource consumption and classical communication round, and also face weak random security vulnerabilities. We propose an efficient hyperentanglement-based QSS protocol without the basis selection, in which the dealer and partners share a polarization-momentum hyperentangled Greenberger-Horne-Zeilinger (GHZ) state and encode keys in the polarization degree of freedom (DOF). The dealer decodes the transmitted keys relying on the nonlocal hyperentanglement-assisted polarization GHZ state analysis. Our QSS protocol is unconditionally secure in theory. We develop simulation method to estimate its performance in practical environment. Compared with the QSS based on the GHZ state, our protocol has several advantages. First, it does not require basis selection and can completely distinguish eight polarization GHZ states, which can improve the utilization rate of entanglement resources to 100% and increase the key generation rate by an order of magnitude. Second, it only requires one round of classical communication, and thus can reduce key generation time by 69.4%. Third, it can eliminate the weak random security vulnerabilities associated with the basis selection. Finally, our protocol only uses linear optical elements, which makes it practically feasible. Our QSS protocol has potential application in future quantum communication network....
IPv6 over Low-Power Wireless Personal Area Networks (6LoWPAN) are specifically designed for applications that require lower data rates and reduced power consumption in wireless internet connectivity. In the context of 6LoWPAN, Internet of Things (IoT) devices with limited resources can now seamlessly connect to the network using IPv6. This study focuses on examining the performance and power consumption of routing protocols in the context of 6LoWPAN, drawing insights from prior research and utilizing simulation techniques. The simulation involves the application of routing protocols, namely Routing Protocol for Low-power and Lossy (RPL) Networks, Ad hoc On-demand Distance Vector (AODV), Lightweight On-demand Ad hoc Distance-vector Next Generation (LOADng), implemented through the Cooja simulator. The simulation also runs in different network topologies to gain an insight into the performance of the protocols in the specific topology including random, linear, and eclipse topology. The raw data gathered from the tools including Powertrace and Collect-View were then analyzed with Python code to transfer into useful information and visualize the graph. The results demonstrate that the power consumption, specifically CPU power, Listen Power, and Total Consumption Power, will increase with the incremental of motes. The result also shows that RPL is the most powerefficient protocol among the scenarios compared to LOADng and AODV. The result is helpful because it brings insights into the performance, specifically power consumption in the 6LoWPAN network. This result is valuable to further implement these protocols in the testbed as well as provide an idea of the algorithmic enhancements....
Column semantic-type detection is a crucial task for data integration and schema matching, particularly when dealing with large volumes of unlabeled tabular data. Existing methods often rely on supervised learning models, which require extensive labeled data. In this paper, we propose SNMatch, an unsupervised approach based on a Siamese network for detecting column semantic types without labeled training data. The novelty of SNMatch lies in its ability to generate the semantic embeddings of columns by considering both format and semantic features and clustering them into semantic types. Unlike traditional methods, which typically rely on keyword matching or supervised classification, SNMatch leverages unsupervised learning to tackle the challenges of column semantic detection in massive datasets with limited labeled examples. We demonstrate that SNMatch significantly outperforms current state-of-the-art techniques in terms of clustering accuracy, especially in handling complex and nested semantic types. Extensive experiments on the MACST and VizNet-Manyeyes datasets validate its effectiveness, achieving superior performance in column semantic-type detection compared to methods such as TF-IDF, FastText, and BERT. The proposed method shows great promise for practical applications in data integration, data cleaning, and automated schema mapping, particularly in scenarios where labeled data are scarce or unavailable. Furthermore, our work builds upon recent advances in neural network-based embeddings and unsupervised learning, contributing to the growing body of research in automatic schema matching and tabular data understanding....
This article is about TCP and UDP transport layer control bits. The aim is to encode some control bits in TCP and UDP headers in order to improve their reliability. This will ensure that some packets that arrive at the receiving side with only bit errors in the header part can be corrected and thus be delivered to the application layer without problem instead of being retransmitted or discarded. This is done by suggesting an adaptive scaling of the source port number and destination port number fields. In the case of TCP, this will provide in some cases, enough bits that will be added to the bits of the Urgent pointer field, Data-offset part, and the reserved field on a quest of a good coding rate....
Loading....